Application-Oriented Finite Sample Experiment Design: A Semidefinite Relaxation Approach
نویسندگان
چکیده
In this paper, the problem of input signal design with the property that the estimated model satisfies a given performance level with a prescribed probability is studied. The aforementioned performance level is associated with a particular application. This problem is well-known to fall within the class of chance-constrained optimization problems, which are nonconvex in most cases. Convexification is attempted based on a Markov inequality, leading to semidefinite programming (SDP) relaxation formulations. As applications, we focus on the identification of multiple input multiple output (MIMO) wireless communication channel models for minimum mean square error (MMSE) channel equalization and zero-forcing (ZF) precoding.
منابع مشابه
A semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملSemidefinite programming for min-max problems and games
We consider two min-max problems: (1) minimizing the supremum of finitely many rational functions over a compact basic semi-algebraic set and (2) solving a 2-player zero-sum polynomial game in randomized strategies with compact basic semi-algebraic sets of pure strategies. In both problems the optimal value can be approximated by solving a hierarchy of semidefinite relaxations, in the spirit of...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملRobust design of biological experiments
We address the problem of robust, computationally-efficient design of biological experiments. Classical optimal experiment design methods have not been widely adopted in biological practice, in part because the resulting designs can be very brittle if the nominal parameter estimates for the model are poor, and in part because of computational constraints. We present a method for robust experime...
متن کاملD-optimal Design for Multivariate Polynomial Regression via the Christoffel Function and Semidefinite Relaxations
We present a new approach to the design of D-optimal experiments with multivariate polynomial regressions on compact semi-algebraic design spaces. We apply the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically and approximately the optimal design problem. The geometry of the design is recovered with semidefinite programming duality theory and the Christof...
متن کامل